0 Ju l 2 00 5 Integer points on a curve and the plane Jacobian problem ∗

نویسنده

  • Nguyen Van Chau
چکیده

A polynomial map F = (P,Q) ∈ Z[x, y]2 with Jacobian JF := PxQy −PyQx ≡ 1 has polynomial inverse of integer coefficients if the complex plane curve P = 0 has infinitely many integer points. 2000 Mathematical Subject Classification: 14R15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 9 Ju l 2 00 7 A note on curves equipartition

The problem of the existence of an equi-partition of a curve in R has recently been raised in the context of computational geometry (see [2] and [3]). The problem is to show that for a (continuous) curve Γ : [0, 1] → R and for any positive integer N , there exist points t0 = 0 < t1 < . . . < tN−1 < 1 = tN , such that d(Γ(ti−1),Γ(ti)) = d(Γ(ti),Γ(ti+1)) for all i = 1, . . . , N , where d is a me...

متن کامل

ar X iv : m at h - ph / 0 50 60 57 v 2 2 6 Ju l 2 00 5 Hjelmslev Geometry of Mutually Unbiased Bases

The basic combinatorial properties of a complete set of mutually unbiased bases (MUBs) of a q-dimensional Hilbert space Hq, q = p with p being a prime and r a positive integer, are shown to be qualitatively mimicked by the configuration of points lying on a proper conic in a projective Hjelmslev plane defined over a Galois ring of characteristic p and rank r. The q vectors of a basis of Hq corr...

متن کامل

3 0 Ju l 2 00 8 Serre ’ s Uniformity in the Split Cartan Case

We prove that there exists an integer p0 such that X split (p)(Q) is made of cusps and CM-points for any prime p > p0. Equivalently, for any non-CM elliptic curve E over Q and any prime p > p0 the image of the Galois representation ρE,p is not contained in the normalizer of a split Cartan subgroup. This gives a partial answer to an old question of Serre.

متن کامل

Counting Points on the Jacobian Variety of a

Counting the order of the Jacobian group of a hyperelliptic curve over a nite eld is very important for constructing a hyperelliptic curve cryptosystem (HECC), but known algorithms to compute the order of a Jacobian group over a given large prime eld need very long running times. In this note, we propose a practical polynomial-time algorithm to compute the order of the Jacobian group for a hype...

متن کامل

A ug 2 00 2 CURVES OF EVERY GENUS WITH MANY POINTS , II : ASYMPTOTICALLY GOOD FAMILIES

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant cq with the following property: for every integer g ≥ 0, there is a genus-g curve over Fq with at least cqg rational points over Fq. Moreover, we show that there exists a positive constant d such tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008